A Framework for Bottom Up Specialisation of Logic Programs

Bottom up Specialisation: towards General Foundations ?

In this abstract, we develop a solid theoretical foundation for a bottom-up program specialisation technique, capable of specialising a logic program w.r.t. a set of unit clauses. Extending a well-known operator, originally introduced for composing logic programs, we deene a bottom-up partial deduction operator and prove correctness of the transformation with respect to the S-semantics.

Specialising Logic Programs with Respect to Call?Post Specifications

In this paper we present a program specialisation method which, given a call/post speciication, transforms a logic program into a weakly call-correct one satisfying the post-condition. The specialisation is applied to specialised partially correct programs. This notion is based on the deenition of specialised derivation which is intended to describe program behaviour whenever some properties on...

Program Specialisation and Abstract Interpretation Reconciled Program Specialisation and Abstract Interpretation Reconciled Program Specialisation and Abstract Interpretation Reconciled

We clarify the relationship between abstract interpretation and program spe-cialisation in the context of logic programming. We present a generic top-down abstract specialisation framework, along with a generic correctness result, into which a lot of the existing specialisation techniques can be cast. The framework also shows how these techniques can be further improved by moving to more re-ned...

Specialising The OtherWay Around

In this paper, we present a program transformation based on bottom up evaluation of logic programs. We explain that using this technique, programs can be \specialised" w.r.t. a set of unit clauses instead of a query. Moreover, examples indicate that excellent specialisation can be obtained when this bottom up transformation is combined with a more traditional top down approach, resulting in con...

Bottom - up Specialisation of Logic